Comparability Graphs and Molecular Properties :

نویسنده

  • Oskar E. Polansky
چکیده

The development of a recently proposed method for calculating molecular properties is outlined. The approach is based on the idea of constructing optimized compound samples for structure-property or structure-activity correlations by means of the so-cailed comparability graphs (CG) of isomeric compounds. A dynamic comparability principle is devised, proceeding from a series of standard molecular rearrangements described in graph-theoretical terms as rules on molecular branching and cyclicity. An extension of the approach is presented for both the construction of CG's and their combination for variable numbers of atoms. The method is applied to various physico-chemical properties, which are thus divided into three groups according to the degree to which they are conditioned by molecular topology. The Wiener topological index is shown to produce a highly linear correlation with the alkane critical densities and volumes, as weil as with their heats and entropies of vaporization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel algorithms for P4-comparability graphs

We consider two problems pertaining to P4-comparability graphs, namely, the problem of recognizing whether a simple undirected graph is a P4-comparability graph and the problem of producing an acyclic P4-transitive orientation of such a graph. Sequential algorithms for these problems have been presented by Hoàng and Reed and very recently by Raschle and Simon, and by Nikolopoulos and Palios. In...

متن کامل

Even and Odd Pairs in Comparability and in P4-comparability Graphs

We characterize even and odd pairs in comparability and in P 4-comparability graphs. The characterizations lead to simple algorithms for deciding whether a given pair of vertices forms an even or odd pair in these classes of graphs. The complexities of the proposed algorithms are O(n + m) for comparability graphs and O(n 2 m) for P 4-comparability graphs. The former represents an improvement ov...

متن کامل

Minimal comparability completions

We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a comparability graph, called a comparability completion of the input graph. Computing a comparability completion with the minimum possible number of added edges is an NP-hard problem. Our purpose here is to add an inclusion minimal set of edges to obtain a minimal comparability completion, which mean...

متن کامل

Treelike Comparability Graphs

A comparability graph is a simple graph which admits a transitive orientation on its edges. Each one of such orientations defines a poset on the vertex set, and also it is said that this graph is the comparability graph of the poset. A treelike poset is a poset whose covering graph is a tree. Comparability graphs of arborescence posets are known as trivially perfect graphs. These have been char...

متن کامل

Polarity and Monopolarity of $3$-colourable comparability graphs

We sharpen the result that polarity and monopolarity are NP-complete problems by showing that they remain NP-complete if the input graph is restricted to be a 3-colourable comparability graph. We start by presenting a construction reducing 1-3-SAT to monopolarity of 3-colourable comparability graphs. Then we show that polarity is at least as hard as monopolarity for input graphs restricted to a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005